Distributed Coordination Strategies for Wide-Area Patrol
نویسندگان
چکیده
This paper addresses the problem of enabling a group of autonomous vehicles to effectively patrol an environment significantly larger than their communication and sensing radii. The environment is divided into smaller areas and special coordinator vehicles are designated to control the transfer of the other vehicles from one area to another. Our past work showed that by organizing the areas and coordinators into a ring topology, we could design a control algorithm that globally balanced the number of vehicles in all areas within a bounded length of time. This paper extends those results to a much broader class of area-coordinator topologies and this added flexibility can be used in implementation to reduce the time it takes to attain the globally balanced state.
منابع مشابه
Ship patrol: multiagent patrol under complex environmental conditions
In the problem of multiagent patrol, a team of agents is required to repeatedly visit a target area in order to monitor possible changes in state. The growing popularity of this problem comes mainly from its immediate applicability to a wide variety of domains. In this paper we concentrate on frequency-based patrol, in which the agents’ goal is to optimize a frequency criterion, namely, minimiz...
متن کاملCooperative multi-robot patrol with Bayesian learning
Patrolling indoor infrastructures with a team of cooperative mobile robots is a challenging task, which requires effective multi-agent coordination. Deterministic patrol circuits for multiple mobile robots have become popular due to their exceeding performance. However their predefined nature does not allow the system to react to changes in the system’s conditions or adapt to unexpected situati...
متن کاملDesigning Patrol Strategies to Maximize Pristine Forest Area
Illegal extraction of forest resources is fought, in many developing countries, by patrols that seek to deter such activity by decreasing its profitability. With a limited budget, a patrol strategy will seek to distribute the patrols throughout the forest, in order to minimize the resulting amount of extraction that occurs or maximize the amount of “pristine” forest area. Prior work in forest e...
متن کاملWanKeeper: Efficient Coordination at WAN scale
Traditional coordination services for distributed applications do not scale well over wide-area networks (WAN): centralized coordination fails to scale with respect to the increasing distances in the WAN, and distributed coordination fails to scale with respect to the number of nodes involved. We argue that it is possible to achieve scalability over WAN using a hierarchical coordination archite...
متن کاملEfficiently Patrolling Hamiltonian and Two-Connected Graphs
We present two probabilistic patrolling strategies for a single agent patrolling an undirected graph. A single ant-like agent with very low capabilities is considered, the agent have small memory and he can sense only its neighborhood. However, he may mark the graph vertices with pheromone stamps which can later be sensed. These markings are used as a primitive form of distributed memory. The f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Intelligent and Robotic Systems
دوره 56 شماره
صفحات -
تاریخ انتشار 2009